Chaotic Random Opposition-Based Learning and Cauchy Mutation Improved Moth-Flame Optimization Algorithm for Intelligent Route Planning of Multiple UAVs

نویسندگان

چکیده

UAV route planning is the key issue for application of in real-world scenarios. Compared with traditional methods, although intelligent optimization algorithm has stronger applicability and performance, it also problem poor convergence accuracy easy to fall into local optimization. Therefore, an method based on chaotic random opposition-based learning cauchy mutation improved Moth-flame (OLTC-MFO) proposed. First, terrain environment constructed by digital elevation map, threat model established realize equivalent three-dimensional (3D) environment. Then, opposite population introduced increase diversity solutions improve search speed algorithm. Logistic-Tent chaos map perturbation flame position, which improves global capability Finally, probability operator Cauchy are introduced, makes not only accept current solution a certain probability, but jump out sub-optimal solution, thus enhancing The simulation results show that when number iterations 1000, length OLTC-MFO 45.3716km shorter than MFO algorithm, result this stable more accurate, achieves purpose assisting combat decision-making.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Cat Swarm Optimization Algorithm Based on Opposition-Based Learning and Cauchy Operator for Clustering

Clustering is a NP-hard problem that is used to find the relationship between patterns in a given set of patterns. It is an unsupervised technique that is applied to obtain the optimal cluster centers, especially in partitioned based clustering algorithms. On the other hand, cat swarm optimization (CSO) is a new metaheuristic algorithm that has been applied to solve various optimization problem...

متن کامل

STATIC AND DYNAMIC OPPOSITION-BASED LEARNING FOR COLLIDING BODIES OPTIMIZATION

Opposition-based learning was first introduced as a solution for machine learning; however, it is being extended to other artificial intelligence and soft computing fields including meta-heuristic optimization. It not only utilizes an estimate of a solution but also enters its counter-part information into the search process. The present work applies such an approach to Colliding Bodies Optimiz...

متن کامل

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

Opposition-Based Artificial Bee Colony with Dynamic Cauchy Mutation for Function Optimization

This paper presents a new Artificial Bee Colony (ABC) optimization algorithm to solve function optimization problems. The proposed approach is called OCABC, which introduces opposition-based learning concept and dynamic Cauchy mutation into the standard ABC algorithm. To verify the performance of OCABC, eight well-known benchmark function optimization problems are used in the experiments. Exper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3172710